- weakly connected components
- Математика: слабо связанные компоненты
Универсальный англо-русский словарь. Академик.ру. 2011.
weakly connected components
Смотреть что такое "weakly connected components" в других словарях:
Connected category — In category theory, a branch of mathematics, a connected category is a category in which, for every two objects X and Y there is a finite sequence of objects with morphisms or for each 0 ≤ i < n (both directions are allowed in the same… … Wikipedia
Locally connected space — In this topological space, V is a neighbourhood of p and it contains a connected neighbourhood (the dark green disk) that contains p. In topology and other branches of mathematics, a topological space X is locally connected if every point admits… … Wikipedia
WCC — • Weakly Connected Components Peripherie im Web, das über das Zentrum (12.)) irgendwie zu erreichen ist • World Computer Conference ( > IEEE Standard Dictionary ) … Acronyms
Finite topological space — In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space for which there are only finitely many points.While topology is mostly interesting only for… … Wikipedia
WCC — [1] Weakly Connected Components Peripherie im Web, das über das Zentrum (12.)) irgendwie zu erreichen ist [2] World Computer Conference ( > IEEE Standard Dictionary ) … Acronyms von A bis Z
Glossary of topology — This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Anomaly (physics) — In quantum physics an anomaly or quantum anomaly is the failure of a symmetry of a theory s classical action to be a symmetry of any regularization of the full quantum theory. In classical physics an anomaly is the failure of a symmetry to be… … Wikipedia
Twelvefold way — In combinatorics, the twelvefold way is a name given to a systematic classification of 12 related enumerative problems concerning two finite sets, which include the classical problems of counting permutations, combinations, multisets, and… … Wikipedia
